Lagrangian Relaxation Based Congestion Driven Analytical Placement

نویسنده

  • Bao Liu
چکیده

Analytical VLSI placement techniques achieved high solution quality and strong extensibility based on smooth approximation of placement objective and constraints. However, significant room still exist for VLSI placement to improve. We observe at least two sources of placement complexity and inaccuracy, namely, poor predictability for placement metrics and poor controllability of placement constraints. In particular, we observe that existing analytical placement techniques enhance the non-overlapping feasibility constraints by minimizing layout density deviation across a chip, which is an over-constraint, and propose congestion driven analytical placement for more effective placement feasibility enhancement and more accurate routing congestion control. Furthermore, we observe that analytical placement is an Lagrangian relaxation process, and apply Lagrangian relaxation techniques to analytical placement. Our experimental results show that our proposed congestion driven analytical placement achieves an average of 5.1% postlegalization wirelength reduction for 16 industry design and ISPD placement contest benchmark test cases compared with the existing cell density deviation minimization based analytical placement techniques, e.g., APlace [7].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Origin - Destination Demand Flow Estimation under Congested Traffic Conditions

This paper presents a single-level nonlinear optimization model to estimate dynamic origindestination (OD) demand. A path flow-based optimization model, which incorporates heterogeneous sources of traffic measurements and does not require explicit dynamic link-path incidences, is developed to minimize (i) the deviation between observed and estimated traffic states and (ii) the deviation between...

متن کامل

A Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem

Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. Accordingly, the population of elderlies has been increased. By another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. Hence, Home Health Care (HHC) operations including a set of nurses and patients have been develope...

متن کامل

Area/congestion-driven Placement for Vlsi Circuit Layout

AREA/CONGESTION-DRIVEN PLACEMENT FOR VLSI CIRCUIT LAYOUT Zhen Yang University of Guelph, 2003 Advisor: Professor Shawki Areibi This thesis presents and compares several global wirelength-driven placement algorithms. Both flat and hierarchical approaches are implemented to find the effectiveness of these approaches. Experiments conducted indicate that the Attractor-Repeller Placer (ARP) method p...

متن کامل

Multiship Crane Sequencing with Yard Congestion Constraints

Crane sequencing in container terminals determines the order of ship discharging and loading jobs that quay cranes (QCs) perform so that the duration of vessels’ stay is minimized. The ship’s load profile, berthing time, number of available bays and QCs are considered. More importantly, clearance and yard congestion constraints need to be included, which respectively ensure that a minimum dista...

متن کامل

Distribution Network Design: Selection and Sizing of Congested Connections

This paper focuses on certain types of distribution networks in which commodity flows must go through connections that are subject to congestion. Connections serve as transshipment and/or switching points and are modeled asM/G/1 queues. The goal is to select connections, assign flows to the connections, and size their capacities, simultaneously. The capacities are controlled by both the mean an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010